A Distributed Algorithm for Ear Decomposition
نویسندگان
چکیده
A distributed algorithm f o r finding an ear decomposition of an asynchronous communication network with n nodes and m links is presented in this paper. At the completion of the algorithm either the ears are correctly labeled o r the nodes are informed that there exists no ear decomposition. First we present a novel algorithm to check the existence of an ear decomposition which uses O(m) messages. W e also present two other algorithms, one which is time-optimal and the other which is message-optimal to determine the actual ears and their corresponding numbers after determining the existence of an ear decomposition.
منابع مشابه
On finding an ear decomposition of an undirected graph distributively
An ear decomposition of a connected undirected graph G= (V ,E) is a partition of the edge (link) set E into a collection of edge-disjoint paths P0,P1, . . . ,P|E|−|V |+1, called ears, such that P0 is a link, P0 ∪P1 is a closed path (i.e., a cycle), and for each i , 2 i |E| − |V | + 1, Pi is a path of which each terminating node belongs to some Pj , j < i , and no internal node belongs to any Pj...
متن کاملParallel Open Ear Decomposition with Applications to Graph Biconnectivity and Triconnectivity
This report deals with a parallel algorithmic technique that has proved to be very useful in the design of eecient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called \open ear decomposition", and we relate this decomposition to graph biconnectivity. We present an eecient parallel algorithm for nding this decomposition a...
متن کاملChapter in SYNTHESIS OF PARALLEL ALGORITHMS
This report deals with a parallel algorithmic technique that has proved to be very useful in the design of e cient parallel algorithms for several problems on undirected graphs. We describe this method for searching undirected graphs, called \open ear decomposition", and we relate this decomposition to graph biconnectivity. We present an e cient parallel algorithm for nding this decomposition a...
متن کاملOn the Laplace transform decomposition algorithm for solving nonlinear differential equations
متن کامل
Solving railway line planning problems using a decomposition algorithm
The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
متن کامل